New robust stable MPC using linear matrix inequalities
نویسندگان
چکیده
منابع مشابه
Further Results on “Robust MPC Using Linear Matrix Inequalities”
This paper presents a novel method for designing the terminal cost and the auxiliary control law (ACL) for robust MPC of uncertain linear systems, such that ISS is a priori guaranteed for the closed-loop system. The method is based on the solution of a set of LMIs. An explicit relation is established between the proposed method and H∞ control design. This relation shows that the LMI-based optim...
متن کاملFinite Horizon Robust Model Predictive Control Using Linear Matrix Inequalities
In this paper, we develop a finite horizon model predictive control algorithm which is robust to model uncertainties. A moving average system matrix is constructed to capture model uncertainties and facilitate future output predictions. The paper is focused on step tracking control. Using linear matrix inequality techniques, the design is converted into a semi-definite optimization problem. Clo...
متن کاملRobust constrained model predictive control using linear matrix inequalities,
The primary disadvantage of current design techriiques for xriodel predictive control (MPC) is their inability to deal explicitly with plant model uncertainty. In this paper, we present a new approacli for robust MPC synthesis which allows explicit irlcorporation of the description of pla,nt uricertainty in the problem formulation. The uncertainty is expressed both in the time domain and the fr...
متن کاملLinear Overhead Robust MPC with Honest Majority Using Preprocessing
We present a technique to achieve O(n) communication complexity per multiplication for a wide class of robust practical MPC protocols. Previously such a communication complexity was only known in the case of non-robust protocols in the full threshold, dishonest majority setting. In particular our technique applies to robust threshold computationally secure protocols in the case of t < n/2 in th...
متن کاملLinear Overhead Optimally-Resilient Robust MPC Using Preprocessing
We present a new technique for robust secret reconstruction with O(n) communication complexity. By applying this technique, we achieve O(n) communication complexity per multiplication for a wide class of robust practical Multi-Party Computation (MPC) protocols. In particular our technique applies to robust threshold computationally secure protocols in the case of t < n/2 in the pre-processing m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Brazilian Journal of Chemical Engineering
سال: 2000
ISSN: 0104-6632
DOI: 10.1590/s0104-66322000000100005